منابع مشابه
Closed Action Calculi
Action calculi provide a framework for capturing many kinds of interactive behaviour by focussing on the primitive notion of names. We introduce a name-free account of action calculi, called the closed action calculi, and show that there is a strong correspondence between the original presentation and the name-free presentation. We also add free names plus natural axioms to the closed world, an...
متن کاملAction Calculi III : Higher-order Calculi
This paper extends an arbitrary action calculus [11] to higher order, in a way which parallels the extension of the -calculus [13] to higher order by Sangiorgi [18]. Action calculi are a subclass of action structures [10], which in turn are an enriched class of monoidal categories. Each action calculus AC(K) is distinguished by its set K of controls and their reaction rules. The notion of actio...
متن کاملSymmetric action calculi
There exist many different calculi for rescribing interactive and sequential behaviour. The goal of action calculi [1] is to unify these calculi at a syntactic and operation level. We introduce a symmetric variant which extends the reach of action calculi to cover for example the Fusion calculus [2] and Yoshida’s process graphs [3]. These symmetric action calculi conservatively extend the refle...
متن کاملLinear type theories, semantics and action calculi
In this thesis, we study linear type-theories and their semantics. We present a general framework for such type-theories, and prove certain decidability properties of its equality. We also present intuitionistic linear logic and Milner’s action calculi as instances of the framework, and use our results to show decidability of their respective equality judgements. Firstly, we motivate our develo...
متن کاملIntegrating Action Calculi and Description Logics
General action languages, like e.g. the Situation Calculus, use full classical logic to represent knowledge of actions and their effects in dynamic domains. Description Logics, on the other hand, have been developed to represent static knowledge with the help of decidable subsets of first order logic. In this paper, we show how to use Description Logic as the basis for a decidable yet still exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00355-7